Pruning in Logic Programming
نویسنده
چکیده
The logic programming community has a love{hate relationship with operators for pruning the search space of logic programs such as cut, commit, once, conditionals and variations on these. Pruning operators typically are not declarative, result in incom-pleteness and/or unsoundness, decrease readability and exibility of code and make program analysis and transformation more diicult. Despite this, nearly all non-trivial Prolog programs contain cuts, nearly all more recent logic programming languages have similar pruning operators and many languages insist on pruning operators in every clause. In practice, logic programming is less logical than functional programming. Why it this so? Do we really need pruning operators? Can we have suuciently powerful pruning operators which do not destroy the declarative semantics of programs? How are pruning operators related to logic, modes, functions and lazy evaluation? This paper attempts to answer some of these questions.
منابع مشابه
Top-Down Pruning in Relational Learning
Pruning is an eeective method for dealing with noise in Machine Learning. Recently pruning algorithms, in particular Reduced Error Pruning, have also attracted interest in the eld of Inductive Logic Programming. However, it has been shown that these methods can be very ineecient, because most of the time is wasted for generating clauses that explain noisy examples and subsequently pruning these...
متن کاملPruning Nodes in the Alpha-Beta Method Using Inductive Logic Programming
This paper reports a preliminary research of application of inductive logic programming for pruning nodes in the alpha-beta gametree search method, which nds an appropriate move by looking game-trees in a limited depth ahead. The alpha-beta method reduces the number of nodes by keeping and updating lower and upper bounds of static evaluation. Pruning e ect depends on an accidental order of node...
متن کاملPruning the Search Space of Logic Programs
We analyse the use of pruning operators for reducing the search space of logic programming computations. The synthesis of a few key choices arising in the implementation of pruning operators allows us to compare alternative pruning strategies at a suitably abstract level. In this perspective, we examine the commit operator featured by the language GG odel.
متن کامل2 Some Problems with Reduced Error
This paper outlines some problems that may occur with Reduced Error Pruning in Inductive Logic Programming, most notably eeciency. Thereafter a new method, Incremental Reduced Error Pruning, is proposed that attempts to address all of these problems. Experiments show that in many noisy domains this method is much more eecient than alternative algorithms , along with a slight gain in accuracy. H...
متن کامل